Generic representation theory of finite fields in nondescribing characteristic
نویسندگان
چکیده
منابع مشابه
differentially closed fields of characteristic zero with a generic automorphism
Hrushovski showed that the theory of difference-differential fields of characteristic zero has a model-companion, which we shall denote DCFA. We give an axiomatization for DCFA and prove some important model-theoretic results as supersimplicity and elimination of imaginaries. We mention some properties of the fixed field and the constant field of a model of DCFA.
متن کاملIndiscreet logarithms in finite fields of small characteristic
Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) in finite fields of small characteristic, despite progress having remained essentially static for nearly thirty years, with the best known algorithms being of subexponential complexity. In this expository article we describe the key insights and constructions which culminated in two independent q...
متن کاملEfficient Arithmetic in Finite Fields of Small Odd Characteristic
In this thesis we present and analyse a generic representation for finite fields of small, odd, characteristic. The technique was originally developed at Ericsson Research, but was improved upon as a part of the thesis work. As the primary practical interest for this class of fields lies in elliptic curve cryptography, we also give an introduction to this subject along with considerations of pa...
متن کاملOn primitive elements in finite fields of low characteristic
We discuss the problem of constructing a small subset of a finite field containing primitive elements of the field. Given a finite field, Fqn , small q and large n, we show that the set of all low degree polynomials contains the expected number of primitive elements. The main theorem we prove is a bound for character sums over short intervals in function fields. Our result is unconditional and ...
متن کاملFinding Primitive Elements in Finite Fields of Small Characteristic
We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field with p elements. In time polynomial in p and n, the algorithm either outputs an element that is provably a generator or declares that it has failed in finding one. Under a heuristic assumption, we argue that the algorithm does always succeed in finding a generator. The algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2015
ISSN: 0001-8708
DOI: 10.1016/j.aim.2014.12.012